Computing pure Nash and strong equilibria in bottleneck congestion games
نویسندگان
چکیده
منابع مشابه
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...
متن کاملPure Nash Equilibria in Player-Specific and Weighted Congestion Games
Unlike standard congestion games, weighted congestion games and congestion games with player-specific delay functions do not necessarily possess pure Nash equilibria. It is known, however, that there exist pure equilibria for both of these variants in the case of singleton congestion games, i. e., if the players’ strategy spaces contain only sets of cardinality one. In this paper, we investigat...
متن کاملComputing Strong Nash Equilibria for Multiplayer Games
A new method for computing strong Nash equilibria in multiplayer games that uses the theoretical framework of generative relations combined with a stochastic search method is presented. Generative relations provide a mean to compare two strategy profiles and to assess their relative quality with respect to an equilibria type. The stochastic method used, called Aumann Crowding Based Differential...
متن کاملApproximate Pure Nash Equilibria in Weighted Congestion Games
We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of αapproximate pure Nash equilibria and the convergence of α-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor α for a given class of cost functions. For example for concave c...
متن کاملApproximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games ∗
We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2012
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-012-0521-3